Straight-Line Drawability of a Planar Graph Plus an Edge
نویسندگان
چکیده
We investigate straight-line drawings of topological graphs that consist of a planar graph plus one edge, also called almost-planar graphs. We present a characterization of such graphs that admit a straight-line drawing. The characterization enables a linear-time testing algorithm to determine whether an almostplanar graph admits a straight-line drawing, and a linear-time drawing algorithm that constructs such a drawing, if it exists. We also show that some almost-planar graphs require exponential area for a straight-line drawing.
منابع مشابه
On Drawing Planar Angle Graphs
Recently, some advanced algorithms for straight line drawings of planar graphs have been introduced. However, these algorithms produce drawings with many small angles. Their drawings are not aesthetically nice. Our goal is to resolve these problems by a beautifier. We consider the angles of planar straight line drawings. In a first phase we compute maximal angles by repeatedly solving a linear ...
متن کاملConnectivity augmentation in planar straight line graphs∗
It is shown that every connected planar straight line graph with n ≥ 3 vertices has an embedding preserving augmentation to a 2-edge connected planar straight line graph with at most b(2n − 2)/3c new edges. It is also shown that every planar straight line tree with n ≥ 3 vertices has an embedding preserving augmentation to a 2-edge connected planar topological graph with at most bn/2c new edges...
متن کاملConnectivity augmentation in plane straight line graphs
It is shown that every connected planar straight line graph with n ≥ 3 vertices has an embedding preserving augmentation to a 2-edge connected planar straight line graph with at most b(2n − 2)/3c new edges. It is also shown that every planar straight line tree with n ≥ 3 vertices has an embedding preserving augmentation to a 2-edge connected planar topological graph by adding at most bn/2c edge...
متن کاملStraight line embeddings of cubic planar graphs with integer edge lengths
We prove that every simple cubic planar graph admits a planar embedding such that each edge is embedded as a straight line segment of integer length. © 2008 Wiley Periodicals, Inc. J Graph Theory 58: 270–274, 2008
متن کاملTri-Edge-Connectivity Augmentation for Planar Straight Line Graphs
It is shown that if a planar straight line graph (PSLG) with n vertices in general position in the plane can be augmented to a 3-edge-connected PSLG, then 2n−2 new edges are enough for the augmentation. This bound is tight: there are PSLGs with n ≥ 4 vertices such that any augmentation to a 3-edge-connected PSLG requires 2n− 2 new edges.
متن کامل